Cartesian product
英 [kɑːˈtiːziən ˈprɒdʌkt]
美 [kɑːrˈtiːziən ˈprɑːdʌkt]
网络 笛卡兒積; 笛卡尔积; 笛卡儿积; 笛卡儿乘积; 笛卡尔乘积
双语例句
- The Adjacent-vertex Distinguishing Total-coloring Problem of Cartesian Product and Double Graph of Some Special Classes Graphs
一些特殊图类的笛卡尔积和倍图的邻点可区别的全染色问题 - Data may seem to disappear at this point since the joins through the fact table is likely more sparse in its combinations than the Cartesian Product results.
此刻数据好像消失了，因为事实表的连接似乎比笛卡尔Product结果更加稀少。 - We now derive, based on the above results, sufficient conditions for a Cartesian product network.
我们现在得出，基于上述结果，有足够的条件，笛卡尔积网络。 - One convex set which is Cartesian product of nonregular convex polygons is used instead of the other convex set which is Cartesian product of regular polygons.
采用不规则凸多边形的笛卡儿积构成的凸集代替正多边形的笛卡儿积构成的凸集，前者比后者更紧凑。 - A join is a Cartesian product of two row sets, with the join predicate applied as a filter to the result.
一个连接是两个行集的笛卡尔乘积，谓词连接作为一个过滤结果应用。 - It is proved that: ( 1) The cartesian product, the lexicographic product and the strong direct product in the products of connected graphs, are the path-positive graphs.
证明了：（1）如果G1和G2都是连通图，则积图中笛卡尔积，逻辑积和强直积都是道路正图。 - Thirdly, the system achieved multi assembly plan design by strongly connected structural aggregations 'Cartesian product operation.
通过强连接集合元间卡氏积的运算实现产品的装配结构多方案设计； - If the number of tuples, calculated by using the Cartesian product, exceeds the set threshold; the NON EMPTY clause is applied to the query.
如果通过使用Cartesian产品计算的元组数超过设定的阈值，将NONEMPTY子句应用于查询。 - Adjacent vertex-distinguishing VE-total coloring of Cartesian product graph of some graphs
部分图笛卡儿积图的邻点可区别VE-全染色 - The binding number of Cartesian product of complete graphs and complete bipartite graphs
完全图与完全偶图的笛卡尔乘积的联结数